Arbitrary-level hanging nodes for adaptivehp-FEM approximations in 3D

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive hp-FEM with Arbitrary-Level Hanging Nodes for Maxwell’s Equations

Adaptive higher-order finite element methods (hp-FEM) are well known for their potential of exceptionally fast (exponential) convergence. However, most hp-FEM codes remain in an academic setting due to an extreme algorithmic complexity of hp-adaptivity algorithms. This paper aims at simplifying hpadaptivity for H(curl)-conforming approximations by presenting a novel technique of arbitrary-level...

متن کامل

Adaptive hp-FEM With Arbitrary-Level Hanging Nodes for Time-Harmonic Maxwell’s Equations

Great algorithmic difficulty of hp-adaptive algorithms is one of the main obstacles preventing adaptive hp-FEM from being employed widely in realistic engineering computations. In order to reduce their complexity, we present a new technique of arbitrary-level hanging nodes that eliminates forced refinements. By forced refinements we mean refinements which are not based on a large value of an er...

متن کامل

On the Inf-sup Condition for Higher Order Mixed Fem on Meshes with Hanging Nodes

We consider higher order mixed finite element methods for the incompressible Stokes or Navier-Stokes equations with Qr-elements for the velocity and discontinuous Pr−1-elements for the pressure where the order r can vary from element to element between 2 and a fixed bound r∗. We prove the inf-sup condition uniformly with respect to the meshwidth h on general quadrilateral and hexahedral meshes ...

متن کامل

The multi-level hp-method for three-dimensional problems: dynamically changing high-order mesh refinement with arbitrary hanging nodes

One main challenge of the hp-version of the finite element method is the high implementational complexity of the method resulting from the added need of handling hanging nodes appropriately. The multi-level hp-formulation—recently introduced for two-dimensional applications—aims at alleviating these difficulties without compromising the approximation quality. This is achieved by changing from t...

متن کامل

Multi-Level hp-Adaptivity: High-Order Mesh Adaptivity without the Difficulties of Constraining Hanging Nodes

hp-refinement schemes have proven to be an excellent approach to locally adapt the accuracy of a Finite Element discretization. However, the implementation of hp-adaptivity remains challenging as hanging nodes, edges, and faces have to be constrained to ensure compatibility of the shape functions. For this reason, most hp-code frameworks restrict themselves to 1-irregular meshes to ease the imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2014

ISSN: 0377-0427

DOI: 10.1016/j.cam.2014.02.010